Comparison of Fast Fourier Transform and Convolution in Wavelength Scanning Interferometry

نویسندگان

  • H. Muhamedsalih
  • X. Jiang
  • F. Gao
چکیده

The assessment of surface finish has become increasingly important in the field of precision engineering. Optical interferometry has been widely used for surface measurement due to the advantages of non-contact and high accuracy interrogation. In spite of the 2π phase ambiguity that can limit the measurement scale in monochromatic interferometry, other optical interferomtry have succeeded to overcome this problem and to measure both rough and smooth surfaces such as white light interferometry and wavelength scanning interferometry (WSI). The WSI can be used to measure large discontinuous surface profiles by producing phase shifts without any mechanical scanning process. Where the WSI produces the phase shifts by altering the wavelength of a broadband light source and capturing the produced interferograms by a CCD. This paper introduces an optical setup and operation principle of a WSI that used a halogen white light as a broadband illumination source and an acousto-optic tunable filter (AOTF) as a wavelength scanning device. This setup can provide a wide scan range in the visible region. The scanned range is being operated from 682.8 nm to 552.8nm and the number of captured frames is 128. Furthermore, the obtained interferograms from a Linnik interferometer have been analyzed by two methods, Fast Fourier Transform and Convolution. A mathematical description of both methods is presented then a comparison in results accuracy is made between them. The Areal measurement of a standard 4.707μm step height sample shows that FFT and convolution methods could provide a nanometer measurement resolution for the surface finish inspection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interferograms Analysis for Wavelength Scanning Interferometer Using Convolution and Fourier-transform

A convolution and fast Fourier transform methods are proposed separately to analysis a set of interferograms obtained from measurement results of a wavelength scanning interferometer. This paper describes wavelength scanning interferometer setup and the operation principle. Mathematical explanations, for both interferograms analysis methods, are presented. Results of measuring 3μm step height s...

متن کامل

A single-shot line-scanning spatially dispersed short coherence interferometer using Fourier transform profilometry

Single-shot inspection at nanoscale resolution is a problematic challenge for providing on-line inspection of manufacturing techniques such as roll-to-roll processes where the measurand is constantly moving. An example of such a measurement challenge is defect detection on vapor barrier films formed by depositing an aluminum oxide layer several tens of nanometres thick on a flexible polymer sub...

متن کامل

FCT-Based Convolution, Filtering and Correlation of Signals' Unified Structure

This paper focuses on constructing efficient algorithms of the main DSP discrete procedures: convolution, correlation functions and filtering of signals based on discrete cosine transform (DCTII) and presenting them using unified structure. This structure is very useful in reducing the computational complexity by 3 N 2 − real multiplications and 2 N − real additions in comparison with indirect ...

متن کامل

Color Holographic Interferometry (from Holographic Plates to Digital Holography)

ABSTRACT: We propose to detail a comparison of optical non invasive techniques using panchromatic holographic plates and digital holography for analyzing unsteady wake flows. Few years ago, ONERA developed optical methods based on real-time three-wavelength holographic interferometry using transmission and reflection holographic plates. These techniques combine the advantages of differential in...

متن کامل

The Partial Fast Fourier Transform

An efficient algorithm for computing the one-dimensional partial fast Fourier transform fj = ∑c(j) k=0 e Fk is presented. Naive computation of the partial fast Fourier transform requires O(N) arithmetic operations for input data of length N . Unlike the standard fast Fourier transform, the partial fast Fourier transform imposes on the frequency variable k a cutoff function c(j) that depends on ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015